Probability propagation rules for Aristotelian syllogisms

نویسندگان

چکیده

We present a coherence-based probability semantics and propagation rules for (categorical) Aristotelian syllogisms. For framing the syllogisms as probabilistic inferences, we interpret basic syllogistic sentence types A, E, I, O by suitable precise imprecise conditional assessments. Then, define validity of inferences notions existential import which is required, Based on generalization de Finetti's fundamental theorem to probability, investigate coherent argument forms Figures II, III, respectively. These results allow show, all three figures, that each traditionally valid syllogism also in our semantics. Moreover, defaults negated defaults. Thereby, build bridge from nonmonotonic reasoning. Then show reductio conversion does not work while ad impossibile can be applied approach. Finally, how proposed used analyze involving generalized quantifiers (like Most).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inference Rules for Probability Logic

Gentzen’s and Prawitz’s approach to deductive systems, and Carnap’s and Popper’s treatment of probability in logic were two fruitful ideas of logic in the mid-twentieth century. By combining these two concepts, the notion of sentence probability, and the deduction relation formalized by means of inference rules, we introduce a system of inference rules based on the traditional proof-theoretic p...

متن کامل

Models for Modal Syllogisms

A semantics is presented for Storrs McCalΓs separate axiomatizations of Aristotle's accepted and rejected polysyllogisms. The polysyllogisms under discussion are made up of either assertoric or apodeictic propositions. The semantics is given by associating a property with a pair of sets: one set consists of things having the property essentially and the other of things having it accidentally. A...

متن کامل

{dasasap}, an App for Syllogisms

The main goal of this contribution is to introduce a cross-platform application to learn-teach syllogistic. We call this application dasasap for develop all syllogisms as soon as possible. To introduce this application we show the logical foundations for the game with a system we call L , and its interface developed with LiveCode. 1998 ACM Subject Classification F.4.1 Mathematical Logic, K.8 Pe...

متن کامل

Probability Propagation Nets

This work introduces a Petri net representation for the propagation of probabilities and likelihoods, which can be applied to probabilistic Horn abduction, fault trees, and Bayesian networks. These so-called “probability propagation nets” increase the transparency of propagation processes by integrating structural and dynamical aspects into one homogeneous representation. It is shown by means o...

متن کامل

Inside-Outside Probability Computation for Belief Propagation

In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be generalized to one between BP for junction trees and the generalized inside-outside probability computation for probabilistic logic programs applied to junction trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2023

ISSN: ['0168-0072', '1873-2461']

DOI: https://doi.org/10.1016/j.apal.2023.103340